The following five macros are the basis for dkom with doubly - linked lists 下面五個宏是帶有雙向鏈表的dkom的基礎(chǔ)。
A doubly - linked list links its elements both backward and forward in a circular fashion 在一個循環(huán)方式中,雙鏈接列表既向前又向后鏈接他的元素。
The key feature of a doubly - linked list is that you can add or remove elements anywhere in the list 一個雙鏈接列表的關(guān)鍵特征是:你可以添加或者移除在這個列表中任何位置的元素。
The pages in each level of the index , including the data pages in the leaf level , are linked in a doubly - linked list 索引中每個級別的頁(包括葉級別的數(shù)據(jù)頁)鏈接在一個雙向鏈接的列表中。
All internal data structures , such as b - tree indexes or doubly - linked lists , must be correct at the end of the transaction 事務(wù)結(jié)束時,所有的內(nèi)部數(shù)據(jù)結(jié)構(gòu)(如b樹索引或雙向鏈表)都必須是正確的。
For example , arrays can support dictionary look - up and form the basis for sophisticated kinds of data structures , such as key - value pairs , linked lists , doubly - linked lists , and trees 例如,數(shù)組可以支持字典查詢,并為高級類型的數(shù)據(jù)結(jié)構(gòu),例如鍵-值對、鏈接表、雙鏈表和樹形成基礎(chǔ)。